Nonstandard Models in Recursion Theory and Reverse Mathematics
نویسندگان
چکیده
We give a survey of the study of nonstandard models in recursion theory and reverse mathematics. We discuss the key notions and techniques in effective computability in nonstandard models, and their applications to problems concerning combinatorial principles in subsystems of second order arithmetic. Particular attention is given to principles related to Ramsey’s Theorem for Pairs.
منابع مشابه
Reverse Mathematics & Nonstandard Analysis: Why Some Theorems Are More Equal than Others
Reverse Mathematics is a program in foundations of mathematics initiated by Friedman ([1,2]) and developed extensively by Simpson ([4]). Its aim is to determine which minimal axioms prove theorems of ordinary mathematics. Nonstandard Analysis plays an important role in this program ([3, 5]). We consider Reverse Mathematics where equality is replaced by the predicate ≈, i.e. equality up to infin...
متن کاملNonstandard arithmetic and recursive comprehension
First order reasoning about hyperintegers can prove things about sets of integers. In the author’s paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic Logic 12 (2006), it was shown that each of the “big five” theories in reverse mathematics, including the base theory RCA0, has a natural nonstandard counterpart. But the counterpart RCA0 of RCA0 has a defect: it does not im...
متن کاملNonstandard arithmetic and reverse mathematics
We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard arithmetic. In the earlier paper [HKK1984] we introduced saturation principles in nonstandard arithmetic which are equivalent in strength to strong choice axioms in second order arithmetic. This paper studies principles ...
متن کاملNonstandardness and the bounded functional interpretation
The bounded functional interpretation of arithmetic in all finite types is able to interpret principles like weak König’s lemma without the need of any form of bar recursion. This interpretation requires the use of intensional (rule-governed) majorizability relations. This is a somewhat unusual feature. The main purpose of this paper is to show that if the base domain of the natural numbers is ...
متن کاملThe Strength of Nonstandard Analysis
A weak theory nonstandard analysis, with types at all finite levels over both the integers and hyperintegers, is developed as a possible framework for reverse mathematics. In this weak theory, we investigate the strength of standard part principles and saturation principles which are often used in practice along with first order reasoning about the hyperintegers to obtain second order conclusio...
متن کامل